Model Checking: Software and Beyond

نویسندگان

  • Edmund M. Clarke
  • Flavio Lerda
چکیده

This paper introduces model checking, originally conceived for checking finite state systems. It surveys its evolution to encompass finitely checkable properties of systems with unbounded state spaces, and its application to software and other systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reachability checking in complex and concurrent software systems using intelligent search methods

Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...

متن کامل

A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness

Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...

متن کامل

SAT-based Model Checking: Interpolation, IC3, and Beyond

ion • Fights the state explosion problem • Removes or simplifies details that are irrelevant • Abstract model contains less states • Often – more behaviors – Over-approximation

متن کامل

Scalable Model Checking Beyond Safety - A Communication Fabric Perspective

Scalable Model Checking Beyond Safety A Communication Fabric Perspective by Sayak Ray Doctor of Philosophy in Engineering Electrical Engineering and Computer Sciences University of California, Berkeley Professor Robert K. Brayton, Chair In this research, we have developed symbolic algorithms and their open-source implementations that effectively solve liveness verification problem for industria...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. UCS

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2007